Intervals of the Muchnik Lattice
نویسنده
چکیده
Answering a question raised by Terwijn, we give a lattice-theoretic characterization of the intervals of the Muchnik lattice as a subset of the distributive lattices, valid for all intervals satisfying a cardinality constraint on the size of antichains.
منابع مشابه
The Finite Intervals of the Muchnik Lattice
We characterize the finite intervals of the Muchnik lattice by proving that they form a certain proper subclass of the finite distributive lattices. We also discuss infinite intervals, mainly to conclude that much more is possible here than for the related Medvedev lattice.
متن کاملThe first order theories of the Medvedev and the Muchnik lattice
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of true arithmetic.
متن کاملEmbeddings into the Medvedev and Muchnik lattices of Π1 classes
Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π1 subsets of 2 , under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of Pw. We show that many countable distributive lattices are lattice-embeddable below any non-zero element of PM .
متن کاملAn extension of the recursively enumerable Turing degrees
We embed the upper semilattice of r.e. Turing degrees into a slightly larger structure which is better behaved and more foundationally relevant. For P,Q ⊆ 2, we say P is Muchnik reducible to Q if for all Y ∈ Q there exists X ∈ P such that X is Turing reducible to Y . We let Pw denote the lattice of Muchnik degrees of nonempty Π1 subsets of 2. Pw is a countable distributive lattice with 0 and 1....
متن کاملMass Problems
Informally, mass problems are similar to decision problems. The difference is that, while a decision problem has only one solution, a mass problem is allowed to have more than one solution. Many concepts which apply to decision problems apply equally well to mass problems. For instance, a mass problem is said to be solvable if it has at least one computable solution. Also, one mass problem is s...
متن کامل